#pragma once
#include "RBTree_Set_Map.h"
namespace bit
{
	template <class K, class V>
	class map
	{
		struct Oft
		{
			const K& operator()(const pair<K, V>& data)
			{
				return data.first;
			}
		};
		typedef map<K, V> Self;
		
	public:
		bool insert(const pair<K, V>& data)
		{
			return _m.Insert(data);
		}
	private:
		RBTree<K, pair<K, V>, Oft> _m;
	};
	void MapTest()
	{
		map<int, int> m;
		int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
		for (auto e : a)
		{
			m.insert(make_pair(e, e));
		}
		
	}
}